Computing f(A)b for Matrix Functions
نویسنده
چکیده
For matrix functions f we investigate how to compute a matrix-vector product f(A)b without explicitly computing f(A). A general method is described that applies quadrature to the matrix version of the Cauchy integral theorem. Methods specific to the logarithm, based on quadrature, and fractional matrix powers, based on solution of an ordinary differential equation initial value problem, are also presented
منابع مشابه
Computing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملDetermination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial
Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...
متن کاملNumerical solution of the Sturm-Liouville problem by using Chebyshev cardinal functions
In this manuscript, a numerical technique is presented for finding the eigenvalues of the regular Sturm-Liouville problems. The Chebyshev cardinal functions are used to approximate the eigenvalues of a regular Sturm-Liouville problem with Dirichlet boundary conditions. These functions defined by the Chebyshev function of the first kind. By using the operational matrix of derivative the problem ...
متن کاملA SIMPLE ALGORITHM FOR COMPUTING DETOUR INDEX OF NANOCLUSTERS
Let G be the chemical graph of a molecule. The matrix D = [dij ] is called the detour matrix of G, if dij is the length of longest path between atoms i and j. The sum of all entries above the main diagonal of D is called the detour index of G. In this paper, a new algorithm for computing the detour index of molecular graphs is presented. We apply our algorithm on copper and silver nanoclusters ...
متن کاملWilson wavelets for solving nonlinear stochastic integral equations
A new computational method based on Wilson wavelets is proposed for solving a class of nonlinear stochastic It^{o}-Volterra integral equations. To do this a new stochastic operational matrix of It^{o} integration for Wilson wavelets is obtained. Block pulse functions (BPFs) and collocation method are used to generate a process to forming this matrix. Using these basis functions and their operat...
متن کاملComparison of Three Soft Computing Methods in Estimating Apparent Shear Stress in Compound Channels
Apparent shear stress acting on a vertical interface between the main channel and floodplain in a compound channel serves to quantify the momentum transfer between sub sections of this cross section. In this study, three soft computing methods are used to simulate apparent shear stress in prismatic compound channels. The Genetic Algorithm Artificial neural network (GAA), Genetic Programming (GP...
متن کامل